Block-Diagonal and Constraint Preconditioners for Nonsymmetric Indefinite Linear Systems. Part I: Theory
نویسندگان
چکیده
منابع مشابه
Block-Diagonal and Constraint Preconditioners for Nonsymmetric Indefinite Linear Systems. Part I: Theory
We study block-diagonal preconditioners and an efficient variant of constraint preconditioners for general two-by-two block linear systems with zero (2,2)-block. We derive block-diagonal preconditioners from a splitting of the (1,1)-block of the matrix. From the resulting preconditioned system we derive a smaller, so-called related system that yields the solution of the original problem. Solvin...
متن کاملBlock preconditioners for symmetric indefinite linear systems
This paper presents a systematic theoretical and numerical evaluation of three common block preconditioners in a Krylov subspace method for solving symmetric indefinite linear systems. The focus is on large-scale real world problems where block approximations are a practical necessity. The main illustration is the performance of the block diagonal, constrained, and lower triangular precondition...
متن کاملBlock Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems
Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...
متن کاملBlock Diagonal Preconditioners for the Schur Complement Method Block Diagonal Preconditioners for the Schur Complement Method
We present numerical methods for solving systems of linear equations originated from the discretisation of two-dimensional elliptic partial diierential equations. We are interested in diierential equations that describe heterogeneous and anisotropic phenomena. We use a nonoverlapping domain decomposition method for solving the linear systems. We describe new local preconditioners for the interf...
متن کاملBlock-ADI Preconditioners for Solving Sparse Nonsymmetric Linear Systems of Equations
There is currently a regain of interest in the Alternating Direction Implicit (ADI) algorithms as preconditioners for iterative methods for solving large sparse linear systems, because of their suitability for parallel computing. However, the classical ADI iteration is not directly applicable to Finite Element (FE) matrices, tends to converge too slowly for 3-D problems, and the selection of ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2005
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827502411006